Analytical approximation of transient joint queue-length distributions within finite capacity Markovian queueing networks
ثبت نشده
چکیده
This paper presents an analytical approximate and computationally tractable technique for the transient analysis of finite capacity Markovian networks. The approach is based on a network decomposition that is unique, it decomposes the network into overlapping (non-disjoint) subnetworks. The model approximates the transient queue-length distributions of the subnetworks. It is computationally tractable with a complexity that is linear in the number of subnetworks. We validate the analytical approximations versus simulation-based estimates. A case study based on an urban road network with intricate traffic dynamics demonstrates the model’s capability to approximate complex multi-modal transient joint distributions.
منابع مشابه
Stochastic network link transmission model
This article considers the stochastic modeling of vehicular network flows, including the analytical approximation of joint queue-length distributions. The article presents two main methodological contributions. First, it proposes a tractable network model for finite space capacity Markovian queueing networks. This methodology decomposes a general topology queueing network into a set of overlapp...
متن کاملANALYSIS OF FINITE BUFFER RENEWAL INPUT QUEUE WITH BALKING AND MARKOVIAN SERVICE PROCESS
This paper presents the analysis of a renewal input finite buffer queue wherein the customers can decide either to join the queue with a probability or balk. The service process is Markovian service process ($MSP$) governed by an underlying $m$-state Markov chain. Employing the supplementary variable and imbedded Markov chain techniques, the steady-state system length distributions at pre...
متن کاملProperties and Analysis of Queueing Network Models with Finite Capacities
A b s t r a c t Queueing network models with finite capacity queues and blocking are used to represent systems with finite capacity resources and with resource constraints, such as production, communication and computer systems. Various blocking mechanisms have been defined in literature to represent the various behaviours of real systems with limited resources. Queueing networks with finite ca...
متن کاملMethod for Approximating Joint Stationary Distribution in Finite Capacity Queue with Negative Customers and Bunker for Ousted Customers
Queueing systems and networks with negative customers have been a subject of extensive research for two decades providing means to describe work-removal phenomena in different communication and information processing systems. This paper is the continuation of research devoted to elaboration of mathematical techniques for performance evaluation of queueing systems with different types of negativ...
متن کاملAnalysis of a finite MAP/G/1 queue with group services
The finite capacity queues, G I / P H / 1 / N and PH/G/1 /N, in which customers are served in groups of varying sizes were recently introduced and studied in detail by the author. In this paper we consider a finite capacity queue in which arrivals are governed by a particular Markov renewal process, called a Markovian arrival process (MAP). With general service times and with the same type of s...
متن کامل